64 research outputs found

    Decoherence, einselection, and the quantum origins of the classical

    Full text link
    Decoherence is caused by the interaction with the environment. Environment monitors certain observables of the system, destroying interference between the pointer states corresponding to their eigenvalues. This leads to environment-induced superselection or einselection, a quantum process associated with selective loss of information. Einselected pointer states are stable. They can retain correlations with the rest of the Universe in spite of the environment. Einselection enforces classicality by imposing an effective ban on the vast majority of the Hilbert space, eliminating especially the flagrantly non-local "Schr\"odinger cat" states. Classical structure of phase space emerges from the quantum Hilbert space in the appropriate macroscopic limit: Combination of einselection with dynamics leads to the idealizations of a point and of a classical trajectory. In measurements, einselection replaces quantum entanglement between the apparatus and the measured system with the classical correlation.Comment: Final version of the review, with brutally compressed figures. Apart from the changes introduced in the editorial process the text is identical with that in the Rev. Mod. Phys. July issue. Also available from http://www.vjquantuminfo.or

    Extent, Extremum, and Curvature: Qualitative Numeric Features for Efficient Shape Retrieval

    No full text
    Abstract. In content-based image retrieval we are faced with continuously growing image databases that require efficient and effective search strategies. In this context, shapes play a particularly important role, especially as soon as not only the overall appearance of images is of interest, but if actually their content is to be analysed, or even to be recognised. In this paper we argue in favour of numeric features which characterise shapes by single numeric values. Therewith, they allow compact representations and efficient comparison algorithms. That is, pairs of shapes can be compared with constant time complexity. We introduce three numeric features which are based on a qualitative relational system. The evaluation with an established benchmark data set shows that the new features keep up with other features pertaining to the same complexity class. Furthermore, the new features are well-suited in order to supplement existent methods.

    Towards the Visualisation of Shape Features: The Scope Histogram

    No full text
    Abstract. Classifying objects in computer vision, we are faced with a great many features one can use. This paper argues that diagrammatic representations help to comprehend properties of features. This is important for the purpose of deciding which features should be used for a given classification task. We introduce such a diagrammatic representation for a shape feature and show how it enables one to decide whether this feature helps to distinguish some categories given. Additionally, it shows that the proposed feature keeps up with other features falling into the same complexity class.

    ABSTRACT A Compact Shape Representation for Linear Geographical Objects: The Scope Histogram

    No full text
    In the GIS domain we are often faced with a great amount of shape-related data. Therefore, it is a challenging task to find concise description approaches which support the efficient retrieval of specific objects. In order to address this demand we apply a method that has recently been introduced in the context of shape-based image retrieval of two-dimensional silhouettes, namely the scope histogram. Scope histograms pertain to the group of qualitative shape descriptions as they characterise a shape by the general configuration of its parts. In particular, scope histograms allow the comparison of two shapes with constant time complexity. Despite of its low complexity, the approach achieves promising retrieval results. However, up to now the definition of scope histograms is limited to closed polygons. In this paper we investigate the application of scope histograms to the GIS domain. Since the contour of silhouettes is always closed, a restriction to closed polygons is no limitation in that domain. By contrast, it frequently is when dealing with GIS data. In this domain, we are rather often faced with open polygons; think for example of courses of rivers, borders, and coastlines. Therefore, we modify the original definition of scope histograms in order to be able to handle arbitrary polygons. Although our new definition leads to a more compact description than the original one, retrieval results are even improved by this modification
    • …
    corecore